Asymptotic Behavior of Aldous’ Gossip Process

نویسندگان

  • Shirshendu Chatterjee
  • Rick Durrett
چکیده

Aldous (2007) defined a gossip process in which space is a discrete N ×N torus, and the state of the process at time t is the set of individuals who know the information. Information spreads from a site to its nearest neighbors at rate 1/4 each and at rate N−α to a site chosen at random from the torus. We will be interested in the case in which α < 3, where the long range transmission significantly accelerates the time at which everyone knows the information. We prove three results that precisely describe the spread of information in a slightly simplified model on the real torus. The time until everyone knows the information is asymptotically T = (2 − 2α/3)Nα/3 logN . If ρs is the fraction of the population who know the information at time s and ε is small then, for large N , the time until ρs reaches ε is T (ε) ≈ T+Nα/3 log(3ε/M), whereM is a random variable determined by the early spread of the information. The value of ρs at time s = T (1/3) + tNα/3 is almost a deterministic function h(t) which satisfies an odd looking integro-differential equation. The last result confirms a heuristic calculation of Aldous.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0 M ay 2 01 0 Asymptotic Behavior of Aldous ’ Gossip Process

Aldous (2007) defined a gossip process in which space is a discrete N ×N torus, and the state of the process at time t is the set of individuals who know the information. Information spreads from a site to its nearest neighbors at rate 1/4 each and at rate N−α to a site chosen at random from the torus. We will be interested in the case in which α < 3, where the long range transmission significa...

متن کامل

Asymptotic Genealogy of a Branching Process and a Model of Macroevolution by

Asymptotic Genealogy of a Branching Process and a Model of Macroevolution

متن کامل

A stochastic approximation approach to quasi-stationary distributions on finite spaces

This work is concerned with the analysis of a stochastic approximation algorithm for the simulation of quasi-stationary distributions on finite state spaces. This is a generalization of a method introduced by Aldous, Flannery and Palacios. It is shown that the asymptotic behavior of the empirical occupation measure of this process is precisely related to the asymptotic behavior of some determin...

متن کامل

GGRA: a grouped gossip-based reputation aggregation algorithm

An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...

متن کامل

The ‘birth-and-assassination’ Process

A new variant of a branching process is introduced, with sufficient conditions for it to persist and to die out. The model is applied to discuss the asymptotic stability of a new type of queuing process.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010